#include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>

using namespace std;

const int N = 1e5 + 10;
int head, e[N], ne[N], idx;
int a[N];
bool st[N];
int n;

int main()
{
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    scanf("%d", &n);
    for (int i = 0; i < n; i ++ )
    {
        scanf("%d", &a[i]);
        a[i] = -a[i];
    }
    sort(a, a + n);
    for(int i = 0; i < n; i ++ ) a[i] = -a[i];
    head = -1;
    for (int i = 0; i < n; i++)
    {
        ne[idx] = head, e[idx] = a[i], head = idx ++;
    }
    
    int cnt = n;
    for(int i = head; ~i; i = ne[i])
    {
        int j = e[i];
        if(j > e[head])
        {
            cnt --;
            head = ne[head];
        }
    }

    printf("%d\n", cnt);
    return 0;
}
